package com.kevin.binarysearchtree;

import com.kevin.tree.BinarySearchTree;

/**
 * @Author LXL
 * @Date 2021/5/29 15:01
 **/
public class BinerSearchTree<E> {
    private int size;

    public int size(){
     return size;
    }

    public boolean isEmpty(){
        return size == 0;
    }

    public void clear(){

    }

    public void add(E element){

    }

    public void remove(E element){

    }

    public boolean contains(E element){
        return false;
    }

    private static class Node<E>{
        E element;
        Node<E> parent;
        Node<E> left;
        Node<E> right;

        public Node(E element, Node<E> parent) {
            this.element = element;
            this.parent = parent;
        }
    }
}
